The Complexity of Stochastic Games
نویسنده
چکیده
We consider the complexity of stochastic games { simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP \ co-NP.
منابع مشابه
On the computational complexity of solving stochastic mean-payoff games
We consider some well known families of two-player, zero-sum, turn-based, perfect information games that can be viewed as specical cases of Shapley’s stochastic games. We show that the following tasks are polynomial time equivalent: • Solving simple stochastic games, • solving stochastic mean-payoff games with rewards and probabilities given in unary, and • solving stochastic mean-payoff games ...
متن کاملAlgorithmic and Complexity Theoretic Aspects of Stochastic Games and Polystochastic Games
There is an increasing interest in the computational aspects of stochastic games. Recent years have seen various algorithms for solving different types of stochastic games as well as complexity theoretic results. In this paper, we provide a brief survey of some of these results including our recent results and we discuss some new results as well. We also mention some interesting and relevant op...
متن کاملSolving a Two-Period Cooperative Advertising Problem Using Dynamic Programming
Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...
متن کاملA Near-Optimal Poly-Time Algorithm for Learning a class of Stochastic Games
We present a new algorithm for polynomial time learning of near optimal behavior in stochastic games. This algorithm incorporates and integrates important recent results of Kearns and Singh [ 1998] in reinforcement learning and of Monderer and Tennenholtz [1997] in repeated games. In stochastic games we face an exploration vs. exploitation dilemma more complex than in Markov decision processes....
متن کاملEquilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing optimal strategies and the values of competitive games (stochastic and other games); stable configurations of neural networks; analysing basic stochastic models for evolution like branching processes and for language l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 96 شماره
صفحات -
تاریخ انتشار 1992